RAPPORT Basic process algebra with iteration : completeness of its equational axioms
نویسندگان
چکیده
REPORTRAPPORT Basic process algebra with iteration: completeness of its equational axioms Abstract Bergstra, Bethke & Ponse BBP93] proposed an axiomatisation for Basic Process Algebra extended with (binary) iteration. In this paper, we prove that this axiomatisation is complete with respect to strong bisimulation equivalence. To obtain this result, we will set up a term rewriting system, based on the axioms, and prove that this term rewriting system is terminating, and that bisimilar normal forms are syntactically equal modulo commutativity and associativity of the +.
منابع مشابه
Basic Process Algebra with Iteration: Completeness of its Equational Axioms
Bergstra, Bethke and Ponse proposed an axiomatization for Basic Process Algebra extended with (binary) iteration. In this paper, we prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we will set up a term rewriting system, based on the axioms, and prove that this term rewriting system is terminating, and that bisimilar normal forms...
متن کاملA Complete Equational Axiomatization for Bpa with Preex Iteration
Preex iteration x is added to Basic Process Algebra with deadlock and empty process. We present a nite equational axiomatization for this process algebra, and we prove that this axiomatization is complete with respect to strong bisimulation equivalence. This result is a mild generalization of a similar result in the setting of basic CCS in Fokkink (1994b). To obtain this completeness result, we...
متن کاملA Complete Equational Axiomatization for BPA with Pre x Iteration
Pre x iteration x is added to Basic Process Algebra with deadlock and empty process. We present a nite equational axiomatization for this process algebra, and we prove that this axiomatization is complete with respect to strong bisimulation equivalence. This result is a mild generalization of a similar result in the setting of basic CCS in Fokkink (1994b). To obtain this completeness result, we...
متن کاملA Complete Equational Axiomatization for Prefix Iteration
Prefix iteration a∗x is added to Minimal Process Algebra (MPAδ), which is a subalgebra of BPAδ equivalent to Milner’s basic CCS. We present a finite equational axiomatization for MPA∗ δ , and prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we set up a term rewriting system, based on the axioms, and show that bisimilar terms have...
متن کاملA Complete Equational Axiomatization for Preex Iteration
Preex iteration a x is added to Minimal Process Algebra (MPA), which is a subalgebra of BPA equivalent to Milner's basic CCS. We present a-nite equational axiomatization for MPA , and prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we set up a term rewriting system, based on the axioms, and show that bisimilar terms have the sam...
متن کامل